Quantum Foundations of Classical Reversible Computing
نویسندگان
چکیده
منابع مشابه
Quantum vertex model for reversible classical computing
Mappings of classical computation onto statistical mechanics models have led to remarkable successes in addressing some complex computational problems. However, such mappings display thermodynamic phase transitions that may prevent reaching solution even for easy problems known to be solvable in polynomial time. Here we map universal reversible classical computations onto a planar vertex model ...
متن کاملFoundations of Generalized Reversible Computing
Information loss from a computation implies energy dissipation due to Landauer’s Principle. Thus, increasing the amount of useful computational work that can be accomplished within a given energy budget will eventually require increasing the degree to which our computing technologies avoid information loss, i.e., are logically reversible. But the traditional definition of logical reversibility ...
متن کاملQuantum computing classical physics.
In the past decade, quantum algorithms have been found which outperform the best classical solutions known for certain classical problems as well as the best classical methods known for simulation of certain quantum systems. This suggests that they may also speed up the simulation of some classical systems. I describe one class of discrete quantum algorithms which do so--quantum lattice-gas aut...
متن کاملReversible Computing - Fundamentals, Quantum Computing, and Applications
Make more knowledge even in less time every day. You may not always spend your time and money to go abroad and get the experience and knowledge by yourself. Reading is a good alternative to do in getting this desirable knowledge and experience. You may gain many things from experiencing directly, but of course it will spend much money. So here, by reading reversible computing fundamentals quant...
متن کاملEntanglement in Reversible Quantum Computing
We explicitly model entanglement as a kind of parallelism under the framework of reversible quantum computing. A sound and complete axiomatization is founded. Different to modeling of entanglement in quantum computing, the shadow constant is unnecessary. And also, as a kind of parallelism, entanglement merge is also quite different.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2021
ISSN: 1099-4300
DOI: 10.3390/e23060701